An Explicit Jordan Decomposition of Companion Matrices

نویسندگان

  • F. S. V. BAZÁN
  • S. GRATTON
چکیده

We derive a closed form for the Jordan decomposition of companion matrices including properties of generalized eigenvectors. As a consequence, we provide a formula for the inverse of confluent Vandermonde matrices and results on sensitivity of multiple roots of polynomials.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit polar decomposition of companion matrices

An explicit formula for the polar decomposition of an n n nonsingular companion matrix is derived. The proof involves the largest and smallest singular values of the companion matrix.

متن کامل

On p-semilinear transformations

In this paper, we introduce $p$-semilinear transformations for linear algebras over a field ${bf F}$ of positive characteristic $p$, discuss initially the elementary properties of $p$-semilinear transformations, make use of it to give some characterizations of linear algebras over a field ${bf F}$ of positive characteristic $p$. Moreover, we find a one-to-one correspondence between $p$-semiline...

متن کامل

The cyclic decomposition theorem

8 Matrices 16 8.1 Representation of vector spaces and linear transformations . . . . . . . . . . . . . . . 16 8.2 Similarity transformations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 8.3 Direct sums of matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 8.4 The companion matrix of a polynomial . . . . . . . . . . . . . . . . . . . . . . . ....

متن کامل

Implicit double shift QR-algorithm for companion matrices

In this paper an implicit (double) shifted QR-method for computing the eigenvalues of companion and fellow matrices will be presented. Companion and fellow matrices are Hessenberg matrices, that can be decomposed into the sum of a unitary and a rank 1 matrix. The Hessenberg, the unitary as well as the rank 1 structures are preserved under a step of the QR-method. This makes these matrices suita...

متن کامل

A Fast Algorithm for Computing Pseudospectra of Companion Matrices

The concept of pseudospectra was introduced by Trefethen during the 1990s and became a popular tool to explain the behavior of non-normal matrices. It is well known that the zeros of a polynomial are equal to the eigenvalues of the associated companion matrix. It is feasible to do the sensitivity analysis of the zeros of polynomials by the tool of pseudospectra of companion matrices. Thus, the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007